A Projected Gradient Method for a High-order Model in Image Restoration Problems
نویسندگان
چکیده
Based on the augmented Lagrangian strategy, we propose a projected gradient method for solving the high-order model in image restoration problems. Based on the Bermùdez and Moreno (BM) algorithm, the convergence of the proposed method is proved. We also give the relationship that the semi-implicit gradient descent method can be deduced from the projected gradient method. Some numerical experiments are arranged to demonstrate the efficiency of the proposed method for restoring the gray-level and color images.
منابع مشابه
Smoothing Projected Gradient Method and Its Application to Stochastic Linear Complementarity Problems
A smoothing projected gradient (SPG) method is proposed for the minimization problem on a closed convex set, where the objective function is locally Lipschitz continuous but nonconvex, nondifferentiable. We show that any accumulation point generated by the SPG method is a stationary point associated with the smoothing function used in the method, which is a Clarke stationary point in many appli...
متن کاملA General Framework for a Class of First Order Primal-dual Algorithms for Tv Minimization
We generalize the primal-dual hybrid gradient (PDHG) algorithm proposed by Zhu and Chan in [M. Zhu, and T. F. Chan, An Efficient Primal-Dual Hybrid Gradient Algorithm for Total Variation Image Restoration, UCLA CAM Report [08-34], May 2008], draw connections to similar methods and discuss convergence of several special cases and modifications. In particular, we point out a convergence result fo...
متن کاملProjected Landweber method and preconditioning
The projected Landweber method is an iterative method for solving constrained least-squares problems when the constraints are expressed in terms of a convex and closed set C. The convergence properties of the method have been recently investigated. Moreover, it has important applications to many problems of signal processing and image restoration. The practical difficulty is that the convergenc...
متن کاملSpectral Projected Gradient Method with Inexact Restoration for Minimization with Nonconvex Constraints
This work takes advantage of the spectral projected gradient direction within the inexact restoration framework to address nonlinear optimization problems with nonconvex constraints. The proposed strategy includes a convenient handling of the constraints, together with nonmonotonic features to speed up convergence. The numerical performance is assessed by experiments with hard-spheres problems,...
متن کاملA cyclic projected gradient method
In recent years, convex optimization methods were successfully applied for various image processing tasks and a large number of first-order methods were designed to minimize the corresponding functionals. Interestingly, it was shown recently in [25] that the simple idea of so-called “superstep cycles” leads to very efficient schemes for time-dependent (parabolic) image enhancement problems as w...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2012